A Lagrangian reconstruction of a class of local search methods
نویسندگان
چکیده
Heuristic repair algorithms, a class of local search methods, demonstrate impressive eeciency in solving some large-scale and hard instances of constraint satisfaction problems (CSP's). In this paper, we draw a surprising connection between heuristic repair techniques and the discrete Lagrange multiplier methods by transforming CSP's into zero-one constrained optimization problems. A Lagrangian-based search scheme LSDL is proposed. We show how GENET, a representative heuristic repair algorithm, can be reconstructed from LSDL. The dual viewpoint of GENET as heuristic repair method and Lagrange multiplier method allows us to investigate variants of GENET from both perspectives. Benchmarking results connrm that rst, our reconstructed GENET has the same fast convergence behavior as other GENET implementations reported in the literature, competing favourably with other state-of-the-art methods on a set of hard graph colouring problems. Second, our best variant, which combines techniques from heuristic repair and Lagrangian methods, is always more eecient than the reconstructed GENET, and can better it by an order of magnitude.
منابع مشابه
Controller Placement in Software Defined Network using Iterated Local Search
Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controll...
متن کاملUse of Local Perforator Flaps for Post Burn Reconstruction
BACKGROUND Mainstay of post-burn reconstruction is release and split skin grafting. Pedicle flaps are cumbersome to the patient, require multiple procedures and hospitalization. Free flaps are technically demanding and facilities are not universally available. Here we evaluated the local perforator flaps for post-burn reconstruction. METHODS We have used sixteen perforator propellar flaps fo...
متن کاملAugmented Lagrangian method for solving absolute value equation and its application in two-point boundary value problems
One of the most important topic that consider in recent years by researcher is absolute value equation (AVE). The absolute value equation seems to be a useful tool in optimization since it subsumes the linear complementarity problem and thus also linear programming and convex quadratic programming. This paper introduce a new method for solving absolute value equation. To do this, we transform a...
متن کاملA New Global-Search Method for Designing Filter Banks
In this paper, we present a new global-search method for designing QMF (quadrature-mirrorlter) lter banks. We formulate the design problem as a nonlinear constrained optimization problem, using the reconstruction error as the objective, and the other performance metrics as constraints. This formulation allows us to search for designs that improve over the best existing designs. Due to the nonli...
متن کاملLagrangian Techniques for Solving a Class of Zero-One Integer Linear Programs
We consider a class of zero-one integer programming feasibility problems (0-1 ILPF problems) in which the coeecients of variables can be integers, and the objective is to nd an assignment of binary variables so that all constraints are satissed. We propose a Lagrangian formulation in the continuous space and develop a gradient search in this space. By using two counteracting forces, one perform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998